• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë

Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) ¿¬°ü ±ÔÄ¢ ¸¶ÀÌ´×À» ÀÌ¿ëÇÑ ¿µÀÛ¹® ÇüÅÂ-Åë»ç ¿À·ù ÀÚµ¿ ŽÁö
¿µ¹®Á¦¸ñ(English Title) Automatic Detection of Morpho-syntactic Errors in English Writing using Association Rule Mining
ÀúÀÚ(Author) ±èµ¿¼º   Dongsung Kim  
¿ø¹®¼ö·Ïó(Citation) VOL 38 NO. 03 PP. 0169 ~ 0177 (2011. 03)
Çѱ۳»¿ë
(Korean Abstract)
º» ¿¬±¸¿¡¼­´Â ÀÏ·ÃÀÇ ¿¬±¸¿¡¼­ ¼öÁýµÈ ¿µÀÛ¹® ¿À·ù À¯ÇüÀÇ Á¤Á¦µÈ ÀڷḦ Åä´ë·Î ¿¬°ü ±ÔÄ¢À» »ý¼ºÇÏ°í, ÇнÀÀ» ÅëÇؼ­ È¿¿ë¼ºÀÌ °ËÁõµÈ ¿¬°ü ±ÔÄ¢À» È°¿ëÇؼ­ ¿µÀÛ¹® µ¥ÀÌÅÍÀÇ ÇüÅÂ・Åë»ç ¿À·ù¸¦ ÀÚµ¿À¸·Î ŽÁöÇÑ´Ù. ¿µÀÛ¹® µ¥ÀÌÅÍ¿¡¼­ ÇüÅÂ・Åë»ç ¿À·ù¸¦ ã¾Æ³»´Â ÀÛ¾÷Àº ¸¹Àº ½Ã°£°ú ÀÚ¿øÀÌ ¼Ò¿äµÇ´Â ÀÛ¾÷À̹ǷΠÀÚµ¿È­°¡ ÇʼöÀûÀÌ´Ù. ±âÁ¸ÀÇ ¿¬±¸µéÀÌ Åë°èÀû ¸ðµ¨À» È°¿ëÇÑ ¾îÈÖÀû ¿À·ù¿¡ Ä¡ÁßÇϰųª ¾ð¾î ÀÌ·ÐÀû Ʋ¿¡ ±Ù°ÅÇÑ Åë»ç 󸮿¡ ÁýÁßÇÏ´Â ¹Ý¸é¿¡, º» ¿¬±¸´Â µ¥ÀÌÅÍ ¸¶ÀÌ´×À» ÅëÇؼ­ Á¤Á¦µÈ µ¥ÀÌÅÍ¿¡¼­ ¿¬°ü ±ÔÄ¢À» »ý¼ºÇÏ°í À̸¦ °ËÁõÇÑ ÈÄ ÇüÅ¡¤Åë»ç ¿À·ù¸¦ °¨ÁöÇÑ´Ù. ÀÌÀü ¿¬±¸µé¿¡¼­´Â ÀÌ·ÐÀû Ʋ¿¡ ¸ÂÃß¾îÁø ±ÔÄ¢ »ý¼ºÀ̳ª ¾ð¾î ¸ðµ¨ »ý¼ºÀ» À§ÇÑ ´ë·®ÀÇ ÄÚÆÛ½º µ¥ÀÌÅÍ¿Í °°Àº ´Ù·®ÀÇ Áö½Ä º£À̽º »ý¼ºÀÌ ÇʼöÀûÀε¥, º» ¿¬±¸´Â ÀûÀº ¾çÀÇ Á¤Á¦µÈ µ¥ÀÌÅ͸¦ È°¿ëÇÑ´Ù. ¿µÀÛ¹® ¿À·ù À¯ÇüÀÇ ÇüÅÂ・Åë»ç ¿¬°ü ±ÔÄ¢À» »ý¼ºÇϱâ À§Çؼ­ Apriori ¾Ë°í¸®ÁòÀ» È°¿ëÇÏ¿´´Ù. ¾Ë°í¸®ÁòÀ» ÅëÇؼ­ »ý¼ºµÈ ¿¬°ü ±ÔÄ¢ Áß À߸øµÈ ±ÔÄ¢ÀÌ »ý¼ºµÉ °¡´É¼ºÀÌ ÀÖÀ¸¹Ç·Î, »ó°ü¼º °ËÁ¤, ÄÚ»çÀÎ À¯»çµµ¿Í °°Àº ±ÔÄ¢ È¿¿ë¼ºÀÇ Åë°èÀû °ËÁõÀ» È°¿ëÇؼ­ Ÿ´çÇÑ ±ÔÄ¢¸¸À» ÇнÀÇÏ°í ÃàÀûµÈ ¿¬°ü ±ÔÄ¢µéÀ» ¿µÀÛ¹® ¿À·ù¸¦ ÀÚµ¿À¸·Î ŽÁöÇÏ´Â ½ÇÇè¿¡ È°¿ëÇÏ¿´´Ù. ¿¬±¸ °á°ú·Î ÇüÅÂ・Åë»çÀû ¹®¹ý ¿À·ù¸¦ Á¤È®ÇÏ°Ô Å½ÁöÇÔÀ» ¾Ë ¼ö ÀÖ´Ù.
¿µ¹®³»¿ë
(English Abstract)
Since manual error detection of morpho-syntactic errors of English writing requires lots of time and resources, automation of error detection is essential in both Computer-Assisted Language Learning and English learning studies. This approach aims at automatic detection of morpho-syntactic errors of English writing using association rule mining, which needs three steps of procedures. As the first step, we generate association rules based on the refined data. Second, we statistically verify the generated rules. Third, we testify the verified rules on the test data. Previous studies have focused on either word errors based on the language models using large corpora, or the systems very specific to the complex grammatical theories. Meanwhile, this study uses relatively small amount of data. We used the Apriori algorithm for the rule mining task. Since rules generated by the algorithm can contains lots of noise to be reduced, we apply statistical machine learning methods using correlation coefficient and cosine similarity. This process sifts valid mal-rules for the automatic detection tasks from lots of noise.
Å°¿öµå(Keyword) ÄÄÇ»ÅÍ ¾ð¾î º¸Á¶ ÇнÀ   ¿µÀÛ¹® ¿À·ù ÀÚµ¿ ŽÁö   ÇüÅÂ・Åë»ç ºÐ¼®   ¿µÀÛ¹®   ¿¬°ü ±ÔÄ¢ ¸¶ÀÌ´×   µ¥ÀÌÅÍ ¸¶ÀÌ´×   ±â°èÇнÀ   Apriori Algorithm   Computer-Assisted Language Learning   English Writing Automatic Error Detection   Morpho-syntactic Analysis   English Writing   Association Rule Mining  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå